Single-Scan Skeletonization Driven by a Neighborhood-Sequence Distance
نویسندگان
چکیده
Shape description is an important step in image analysis. Skeletonization methods are widely used in image analysis as they are a powerful tool to describe a shape. Indeed, a skeleton is a one point wide line centered in the shape which keeps the shape’s topology. Commonly, at least two scans of the image are needed for the skeleton computation in the state of art methods of skeletonization. In this work, a single scan is used considering information propagation in order to compute the skeleton. This paper presents also a new single-scan skeletonization using different distances likes d4, d8 and dns.
منابع مشابه
A Method for Quantitative Comparison of 2D Skeletons
Skeletons are widely used shape descriptors which summarize the general form of binary objects. There exist numerous skeletonization techniques that produce various skeleton-like features for the same object. Despite of the fact, that some researchers have made efforts to compare skeletons and evaluate skeletonization algorithms, we propose a new similarity measure that is based on the concept ...
متن کاملA Streaming Distance Transform Algorithm for Neighborhood-Sequence Distances
We describe an algorithm that computes a “translated” 2D Neighborhood-Sequence Distance Transform (DT) using a look up table approach. It requires a single raster scan of the input image and produces one line of output for every line of input. The neighborhood sequence is specified either by providing one period of some integer periodic sequence or by providing the rate of appearance of neighbo...
متن کاملEvaluation of Bi-objective Scheduling Problems by FDH, Distance and Triangle Methods
In this paper, two methods named distance and triangle methods are extended to evaluate the quality of approximation of the Pareto set from solving bi-objective problems. In order to use evaluation methods, a bi-objective problem is needed to define. It is considered the problem of scheduling jobs in a hybrid flow shop environment with sequence-dependent setup times and the objectives of minimi...
متن کاملEvaluation of Bi-objective Scheduling Problems by FDH, Distance and Triangle Methods
In this paper, two methods named distance and triangle methods are extended to evaluate the quality of approximation of the Pareto set from solving bi-objective problems. In order to use evaluation methods, a bi-objective problem is needed to define. It is considered the problem of scheduling jobs in a hybrid flow shop environment with sequence-dependent setup times and the objectives of minimi...
متن کاملEuclidean skeleton via centre-of-maximal-disc extraction
A skeletonization algorithm is presented, characterized by two main features: invariance under isometric transformations of the pattern, and recoverability. The algorithm is driven by the Euclidean distance map of the pattern. Invariance under isometric transformations is guaranteed due to the use of the Euclidean distance to compute the distance map; recoverability is guaranteed by the inclusi...
متن کامل